On The Spectrum of Minimal Defining Sets of Full Designs

نویسندگان

  • Fatih Demirkale
  • Emine Sule Yazici
چکیده

A defining set of a t-(v,k,λ ) design is a subcollection of the block set of the design which is not contained in any other design with the same parameters. A defining set is said to be minimal if none of its proper subcollections is a defining set. A defining set is said to be smallest if no other defining set has a smaller cardinality. A t-(v,k,λ ) design D = (V,B) is called a full design if B is the collection of all possible k-subsets of V . Every simple t-design is contained in a full design and the intersection of a defining set of a full design with a simple t-design contained in it, gives a defining set of the corresponding t-design. With this motivation, in this paper, we study the full designs when t = 2 and k = 3 and we give several families of non-isomorphic minimal defining sets of full designs. Also, it is proven that there exist values in the spectrum of the full design on v elements such that the number of non-isomorphic minimal defining sets on each of these sizes goes to infinity as v→ ∞. Moreover, the lower bound on the size of the defining sets of the full designs is improved by finding the size of the smallest defining sets of the full designs on 8 and 9 points. Also, all smallest defining sets of the full designs on 8 and 9 points are classified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Defining Sets of Full Designs with Block Size Three

A defining set of a t-(v, k, λ) design is a subcollection of its blocks which is contained in no other t-design with the given parameters, on the same point set. A minimal defining set is a defining set, none of whose proper subcollections is a defining set. The spectrum of minimal defining sets of a design D is the set {|M | | M is a minimal defining set of D}. We show that if a t-(v, k, λ) de...

متن کامل

On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs

A defining set of a t-(v, k, λ) design is a partial design which is contained in a unique t-design with the given parameters. A minimal defining set is a defining set, none of whose proper partial designs is a defining set. This paper proposes a new and more efficient algorithm that finds all non-isomorphic minimal defining sets of a given t-design. The complete list of minimal defining sets of...

متن کامل

Minimal defining sets for full 2-(v, 3, v-2) designs

A t-(v, k, J\) design D = (X, B) with B = Pk(X) is called a full design. For t = 2, k = 3 and any v, we give minimal defining sets for these designs. For v = 6 and v = 7, smallest defining sets are found.

متن کامل

Defining sets of G-designs

Several results, analogous to those already obtained for defining sets of t-( v, k,'x) designs, are presented in the case of G-designs. Computational methods and trade structures are used to construct minimal defining sets of each possible size for each of the eight non-isomorphic 4-cycle systems of order 9, and for each of the two non-isomorphic 2-perfect 5cycle systems of order 11. A recursiv...

متن کامل

Minimal defining sets in a family of Steiner triple systems

A defining set of a block design is a subset of the blocks of the design which are a subset of no other design with the same parameters. This paper describes and proves the existence of a certain type of set of blocks in the infinite family of Steiner triple systems isomorphic to the points and lines of the projective geometries over GF(2). It is then proven that these sets of blocks are defini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2014